Distributed Finite-Time and Fixed-Time Nash Equilibrium Seeking for Non-Cooperative Game with Input Saturation

In this paper, a modified distributed Nash equilibrium seeking problem with input saturation has been investigated. The payoff function of each player is related to the communication topology, which closer actual scenes. sigmoid utilized limit range input. Through network between players and gradient players’ functions, finite-time fixed-time protocols are given. Using Lyapunov stability analysis, it determined that action converges if all update their according proposed algorithms. numerical simulations also provided testify